Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
541	Approximation Algorithms for Finding Maximum Independent Sets in Unions of Perfect Graphs Authors: Chakaravarthy, Pandit, Roy, Sabharwal Speaker: Arindam Pal Department of Computer Science and Engineering Indian Institut Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2012-12-01 01:44:16 Comparability graph Perfect graph Clique Independent set Graph coloring Trivially perfect graph Path decomposition Graph theory NP-complete problems Chordal graph
542	Googling Social Interactions: Web Search Engine Based Social Network Construction Sang Hoon Lee1, Pan-Jun Kim2, Yong-Yeol Ahn3,4, Hawoong Jeong1,5* 1 Department of Physics, Korea Advanced Institute of Science and Technol Add to Reading List Source URL: www.yongyeol.com Language: English - Date: 2013-06-28 16:04:37 Statistics Weighted network Correlation and dependence Pearson product-moment correlation coefficient Modularity Google Evolving networks Betweenness centrality Shortest path problem Network theory Graph theory Mathematics
543	Illustrating Stepwise Refinement Shortest Path ASMs Egon Börger Dipartimento di Informatica, Universita di Pisa Add to Reading List Source URL: www-madlener.informatik.uni-kl.de Language: English - Date: 2011-11-02 07:23:18 Search algorithms Graph connectivity Abstract state machines Egon Börger Breadth-first search Graph Shortest path problem Reachability Graph theory Theoretical computer science Mathematics
544	The Safest Path via Safe Zones Saad Aljubayrin#1 Jianzhong Qi#2 Christian S. Jensen∗3 Rui Zhang#2 Zhen He$4 Zeyi Wen#2 # Department of Computing and Information Systems, University of Melbourne Melbourne, Australia Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2015-01-15 17:38:32 Routing algorithms Network theory Shortest path problem Hyperbola Graph Distance Floyd–Warshall algorithm Pseudoforest Connectivity Mathematics Graph theory Theoretical computer science
545	De Bruijn Graph assembly Ben Langmead You are free to use these slides. If you do, please sign the guestbook (www.langmead-lab.org/teaching-materials), or email me ([removed]) and tell me briefly how you’r Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2014-01-28 16:00:23 Directed graph De Bruijn Vertex Graph Bruijn Multigraph Graph theory Eulerian path Degree
546	The University of Adelaide School of Economics Research Paper No[removed]May 2013 Add to Reading List Source URL: economics.adelaide.edu.au Language: English - Date: 2014-08-10 21:21:47 Mathematics Structure Centrality Social network analysis Small-world network Clustering coefficient Average path length Social network Al-Qaeda Graph theory Networks Network theory
547	Graph Structure in the Web — Revisited or A Trick of the Heavy Tail Robert Meusel Sebastiano Vigna Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-02-08 10:05:12 Centrality Connectivity Scale-free network Vertex Directed graph Graph Webgraph Connected component Eulerian path Graph theory Degree Regular graph
548	2Ist\nstralasian lran,por! Research Forum Adelaide, September 1997 Regional Road Networks and Connectivity Roger R Stough Add to Reading List Source URL: www.atrf.info Language: English - Date: 2012-01-02 23:23:40 Theoretical computer science Chaos theory Dimension theory Dynamical systems Fractals Strahler number Fractal dimension Connectivity Shortest path problem Graph theory Mathematics Network theory
549	A Comparison of High-Level Approaches for Speeding Up Pathfinding Nathan R. Sturtevant1 Robert Geisberger Department of Computing Science Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2010-09-17 13:23:12 Search algorithms Network theory Game artificial intelligence Routing algorithms Shortest path problem Breadth-first search Contraction hierarchies A* search algorithm Graph Mathematics Graph theory Theoretical computer science
550	20th International Congress on Modelling and Simulation, Adelaide, Australia, 1–6 December 2013 www.mssanz.org.au/modsim2013 Time Aggregation for Network Design to Meet Time-Constrained Demand N. Bolanda , A. Ernstb , Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-12-04 18:34:51 Theoretical computer science Flow network Maximum flow problem Cut Shortest path problem Graph theory Mathematics Network flow

UPDATE